package Demo20;

/**
 * 搜索插入位置
 * https://leetcode.cn/problems/search-insert-position/description/
 */

class Solution {
    public int searchInsert(int[] nums, int target) {
        int left = 0,right = nums.length - 1;
        while(left < right) {
            int mid = left + (right - left + 1) / 2;
            if(nums[mid] <= target) {
                left = mid;
            }else {
                right = mid - 1;
            }
        }
        return nums[left] >= target ? left : left+1;
    }
}